Elastic Complex Event Processing under Varying Query Load

نویسندگان

  • Thomas Heinze
  • Yuanzhen Ji
  • Yinying Pan
  • Franz Josef Grüneberger
  • Zbigniew Jerzak
  • Christof Fetzer
چکیده

Distributed data stream processing systems, like Twitter Storm or Yahoo! S4, have been primarily focusing on adapting to varying event rates. However, as these systems are becoming increasingly multi-tenant, adaptation to the varying query load is becoming an equally important problem. In this paper we present FUGU – an elastic allocator for Complex Event Processing systems. FUGU uses bin packing to allocate continuous queries to a varying set of nodes. Driven by elasticity requirements FUGU maximizes the overall system utilization while trying to maintain stable processing latencies. The specific contributions of this paper are: (1) introduction of a re-balancing scheme for bin packing allowing FUGU to increase overall system utilization by six percent and (2) a detailed study of achievable system utilization and latency under real-life workload from Frankfurt Stock Exchange.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cost-Aware Query Optimization during Cloud-Based Complex Event Processing

Complex Event Processing describes the problem of timely and continuous processing of event streams. The load of Complex Event Processing systems can vary (e.g., event rates). Static resource provision leads to higher monetary costs because enough resources have to be provided to efficiently handle peak loads. Therefore, most of the time the resources will not be fully utilized. One way to achi...

متن کامل

New Static Scheduling and Elastic Load Balancing Methods for Parallel Query Processing

This paper presents a compile-time optimization methodology for complex relational query processing on a multiprocessor machine. A new scheduling algorithm is proposed to allocate the resources of the machine. A control mechanism traces the query processing and a special hierarchy of supervisors is introduced to interfere in case of load imbalance. Dynamic load balancing is then achieved using ...

متن کامل

Elastic Routing Table with Probable Performance for Congestion Control in DHT Networks

Structured P2P (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and time-varying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elasti...

متن کامل

Adaptive Selective Replication for Complex Event Processing Systems

As of today, active replication is used in complex event processing systems to enable near zero latency take over in case of host failures. Moreover, elastic complex event processing systems adapt their resource consumption to the actual system load. However, active replication is a coarse-grained approach demanding the duplication of all used resources. Therefore, we envision a system adopting...

متن کامل

A Communications-oriented Methodology for Load Balancing in Parallel Relational Query Processing

The increasing amount of data manipulated in very large databases 1 and the complexity of the queries to be processed makes parallelism appear as one of the most promising research axes for future databases applications. Load balancing for relational operators has been widely studied and join algorithms including dynamic load balancing capabilities have been proposed 1]. However, for whole rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013